Supplemental for Spectral Algorithm For Latent Tree Graphical Models
نویسندگان
چکیده
The latent tree structure learned by the algorithm by [1] is shown in Figure 1. The blue nodes are hidden nodes and the red nodes are observed. Note how integrating out some of these hidden nodes could lead to very large cliques. Thus it is not surprising why both our spectral method and EM perform better than Chow Liu. The Chow Liu Tree is shown in Figure 1. Note how it is forced to pick some of the observed variables as hubs even if latent variables may be more natural.
منابع مشابه
A Spectral Algorithm for Latent Tree Graphical Models
Latent variable models are powerful tools for probabilistic modeling, and have been successfully applied to various domains, such as speech analysis and bioinformatics. However, parameter learning algorithms for latent variable models have predominantly relied on local search heuristics such as expectation maximization (EM). We propose a fast, local-minimum-free spectral algorithm for learning ...
متن کاملHierarchical Tensor Decomposition of Latent Tree Graphical Models
We approach the problem of estimating the parameters of a latent tree graphical model from a hierarchical tensor decomposition point of view. In this new view, the marginal probability table of the observed variables is treated as a tensor, and we show that: (i) the latent variables induce low rank structures in various matricizations of the tensor; (ii) this collection of low rank matricizatio...
متن کاملSpectral Learning of Large Structured HMMs for Comparative Epigenomics
We develop a latent variable model and an efficient spectral algorithm motivatedby the recent emergence of very large data sets of chromatin marks from multiplehuman cell types. A natural model for chromatin data in one cell type is a HiddenMarkov Model (HMM); we model the relationship between multiple cell types byconnecting their hidden states by a fixed tree of known structur...
متن کاملSpectral Methods for Learning Multivariate Latent Tree Structure
This work considers the problem of learning the structure of multivariate linear tree models, whichinclude a variety of directed tree graphical models with continuous, discrete, and mixed latent variablessuch as linear-Gaussian models, hidden Markov models, Gaussian mixture models, and Markov evolu-tionary trees. The setting is one where we only have samples from certain observe...
متن کاملSpectral Learning of General Latent-Variable Probabilistic Graphical Models:A Supervised Learning Approach
In this CS 229 project, I designed, proved and tested a new spectral learning algorithm for learning probabilistic graphical models with latent variables by reducing the hard learning problem into a pipeline of supervised learning tasks. This new algorithmic framework can provide us with more learning power by giving us the freedom to plug in all different kinds of supervised learning algorithm...
متن کامل